Milan’s Cycle as an Accurate Leading Indicator for the Italian Business Cycle

A coincident business cycle indicator for the Milan area is built on the basis of a monthly industrial survey carried out by Assolombarda, the largest territorial entrepreneurial association in Italy. The indicator is extracted from three time series concerning the production level and the internal and foreign order book as declared by some 250 Assolombarda associates. This indicator is potentially very valuable in itself, being Milan one of the most dynamic economic systems in Italy and Europe, but it becomes much more interesting when compared to the Italian business cycle as extracted form the Italian industrial production index. Indeed, notwithstanding the deep differences in the nature of the data, the indicator for Milan has an extremely high coherence with the Italian cycle and the former leads the latter by approximately 4-5 months. Furthermore there is a direct relation between the amplitude of the cycle and the leading time of the Milan indicator.Leading indicator, unobserved components model, structural time series model, local business survey

Is Evolution an Algorithm? Effects of local entropy in unsupervised learning and protein evolution

L'abstract è presente nell'allegato / the abstract is in the attachmen

Γ\Gamma-convergence for high order phase field fracture: continuum and isogeometric formulations

We consider second order phase field functionals, in the continuum setting, and their discretization with isogeometric tensor product B-splines. We prove that these functionals, continuum and discrete, $\Gamma$-converge to a brittle fracture energy, defined in the space $GSBD^2$. In particular, in the isogeometric setting, since the projection operator is not Lagrangian (i.e., interpolatory) a special construction is needed in order to guarantee that recovery sequences take values in $[0,1]$; convergence holds, as expected, if $h = o (\varepsilon)$, being $h$ the size of the physical mesh and $\varepsilon$ the internal length in the phase field energy

Linguistically Motivated Vocabulary Reduction for Neural Machine Translation from Turkish to English

The necessity of using a fixed-size word vocabulary in order to control the model complexity in state-of-the-art neural machine translation (NMT) systems is an important bottleneck on performance, especially for morphologically rich languages. Conventional methods that aim to overcome this problem by using sub-word or character-level representations solely rely on statistics and disregard the linguistic properties of words, which leads to interruptions in the word structure and causes semantic and syntactic losses. In this paper, we propose a new vocabulary reduction method for NMT, which can reduce the vocabulary of a given input corpus at any rate while also considering the morphological properties of the language. Our method is based on unsupervised morphology learning and can be, in principle, used for pre-processing any language pair. We also present an alternative word segmentation method based on supervised morphological analysis, which aids us in measuring the accuracy of our model. We evaluate our method in Turkish-to-English NMT task where the input language is morphologically rich and agglutinative. We analyze different representation methods in terms of translation accuracy as well as the semantic and syntactic properties of the generated output. Our method obtains a significant improvement of 2.3 BLEU points over the conventional vocabulary reduction technique, showing that it can provide better accuracy in open vocabulary translation of morphologically rich languages.Comment: The 20th Annual Conference of the European Association for Machine Translation (EAMT), Research Paper, 12 page

Space-time least-squares isogeometric method and efficient solver for parabolic problems

In this paper, we propose a space-time least-squares isogeometric method to solve parabolic evolution problems, well suited for high-degree smooth splines in the space-time domain. We focus on the linear solver and its computational efficiency: thanks to the proposed formulation and to the tensor-product construction of space-time splines, we can design a preconditioner whose application requires the solution of a Sylvester-like equation, which is performed efficiently by the fast diagonalization method. The preconditioner is robust w.r.t. spline degree and mesh size. The computational time required for its application, for a serial execution, is almost proportional to the number of degrees-of-freedom and independent of the polynomial degree. The proposed approach is also well-suited for parallelization.Comment: 29 pages, 8 figure

DNN adaptation by automatic quality estimation of ASR hypotheses

In this paper we propose to exploit the automatic Quality Estimation (QE) of ASR hypotheses to perform the unsupervised adaptation of a deep neural network modeling acoustic probabilities. Our hypothesis is that significant improvements can be achieved by: i)automatically transcribing the evaluation data we are currently trying to recognise, and ii) selecting from it a subset of "good quality" instances based on the word error rate (WER) scores predicted by a QE component. To validate this hypothesis, we run several experiments on the evaluation data sets released for the CHiME-3 challenge. First, we operate in oracle conditions in which manual transcriptions of the evaluation data are available, thus allowing us to compute the "true" sentence WER. In this scenario, we perform the adaptation with variable amounts of data, which are characterised by different levels of quality. Then, we move to realistic conditions in which the manual transcriptions of the evaluation data are not available. In this case, the adaptation is performed on data selected according to the WER scores "predicted" by a QE component. Our results indicate that: i) QE predictions allow us to closely approximate the adaptation results obtained in oracle conditions, and ii) the overall ASR performance based on the proposed QE-driven adaptation method is significantly better than the strong, most recent, CHiME-3 baseline.Comment: Computer Speech & Language December 201

Automatic Quality Estimation for ASR System Combination

Recognizer Output Voting Error Reduction (ROVER) has been widely used for system combination in automatic speech recognition (ASR). In order to select the most appropriate words to insert at each position in the output transcriptions, some ROVER extensions rely on critical information such as confidence scores and other ASR decoder features. This information, which is not always available, highly depends on the decoding process and sometimes tends to over estimate the real quality of the recognized words. In this paper we propose a novel variant of ROVER that takes advantage of ASR quality estimation (QE) for ranking the transcriptions at "segment level" instead of: i) relying on confidence scores, or ii) feeding ROVER with randomly ordered hypotheses. We first introduce an effective set of features to compensate for the absence of ASR decoder information. Then, we apply QE techniques to perform accurate hypothesis ranking at segment-level before starting the fusion process. The evaluation is carried out on two different tasks, in which we respectively combine hypotheses coming from independent ASR systems and multi-microphone recordings. In both tasks, it is assumed that the ASR decoder information is not available. The proposed approach significantly outperforms standard ROVER and it is competitive with two strong oracles that e xploit prior knowledge about the real quality of the hypotheses to be combined. Compared to standard ROVER, the abs olute WER improvements in the two evaluation scenarios range from 0.5% to 7.3%

Existence, energy identity and higher time regularity of solutions to a dynamic visco-elastic cohesive interface model

We study the dynamics of visco-elastic materials coupled by a common cohesive interface (or, equivalently, {two single domains separated by} a prescribed cohesive crack) in the anti-plane setting. We consider a general class of traction-separation laws featuring an activation threshold on the normal stress, softening and elastic unloading. In strong form, the evolution is described by a system of PDEs coupling momentum balance (in the bulk) with transmission and Karush-Kuhn-Tucker conditions (on the interface). We provide a detailed analysis of the system. We first prove existence of a weak solution, employing a time discrete approach and a regularization of the initial data. Then, we prove our main results: the energy identity and the existence of { solutions} with acceleration in $L^\infty (0,T; L^2)$